Comparing Evolutionary Algorithms to the (1+1)-EA by Means of Stochastic Ordering
نویسندگان
چکیده
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of tness distribution function at given iteration and the average optimization time. Our approach is applicable when the reproduction operator of an evolutionary algorithm is dominated by the mutation operator of the (1+1)-EA. In this case one can extend the lower bounds obtained for the expected optimization time of the (1+1)-EA to other EAs based on the dominated reproduction operator. This method is exampled on the sorting problem with HAM landscape and the exchange mutation operator. Also we consider several cases where the (1+1)-EA is the best possible search strategy in the class of the EAs.
منابع مشابه
A Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms
Due to the increasing amount of natural disasters such as earthquakes and floods and unnatural disasters such as war and terrorist attacks, Humanitarian Relief Chain (HRC) is taken into consideration of most countries. Besides, this paper aims to contribute humanitarian relief chains under uncertainty. In this paper, we address a humanitarian logistics network design problem including local dis...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms - How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness
The most simple evolutionary algorithm, the so-called (1+1)EA accepts a child if its fitness is at least as large (in the case of maximization) as the fitness of its parent. The variant (1 + 1)∗EA only accepts a child if its fitness is strictly larger than the fitness of its parent. Here two functions related to the class of long path functions are presented such that the (1 + 1)EA maximizes on...
متن کاملProgressive Type II Censored Order Statistics and their Concomitants: Some Stochastic Comparisons Results
In this paper we prove some stochastic comparisons results for progressive type II censored order statistics. The problem of stochastically comparing concomitants of the two progressive type II censored order statistics with possibly different schemes, under different kinds of dependence between X and Y is considered and it is proved that if Y is stochastically increasing (decreasing) in X, ...
متن کاملAn Analysis Of The Role Of Offspring Population Size In EAs
Evolutionary algorithms (EAs) are general stochastic search heuristics often used to solve complex optimization problems. Unfortunately, EA theory is still somewhat weak with respect to providing a deeper understanding of EAs and guidance for the practitioner. In this paper we improve this situation by extending existing theory on the wellknown (1+1) EA to cover the (1 + ) EA, an EA that mainta...
متن کاملRuntime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions
Although Evolutionary Algorithms (EAs) have been successfully applied to optimization in discrete search spaces, theoretical developments remain weak, in particular for population-based EAs. This paper presents a first rigorous analysis of the (mu+1) EA on pseudo-Boolean functions. Using three well-known example functions from the analysis of the (1+1) EA, we derive bounds on the expected runti...
متن کامل